In order to solve the problems such as low transmission efficiency and high network resource overhead in Internet of Vehicles (IoV) environment, a new routing algorithm based on node cognitive interaction, which is suitable for urban traffic environment, was proposed. Firstly, based on trust theory, a concept of cognitive interaction degree was proposed. Then, based on this, the vehicle nodes in IoV were classified and given with different initial values of cognitive interaction degree. Meanwhile, the influence factors such as interaction time, interaction frequency, physical distance, hops between nodes and the Time-To-Live of message were introduced, and a cognitive interaction evaluation model of vehicle nodes was constructed. The cognitive interaction degrees of vehicle nodes were calculated and updated by using the proposed model, and a neighbor node with higher cognitive interaction degree than others could be selected as relay node to forward the messages after the comparison between the nodes. Simulation results show that compared with Epidemic and Prophet routing algorithms, the proposed algorithm effectively increases the message delivery rate and reduces the message delivery delay, while significantly reducing the overhead of network resources and helping to improve the quality of message transmission in IoV environment

Concerning low efficiency and accuracy of the ridesharing user group discovery in shared transportation environment, a GeoOD-Tree index was established based on R-tree principle, and a group discovery strategy to maximize the multiplying rate was proposed. Firstly, the feature extraction and calibration processing of original spatio-temporal trajectory data was carried out to mine effective Origin-Destination (OD) trajectory. Secondly, a data structure termed GeoOD-Tree was established for effective storage management of OD trajectory. Finally, a group discovery model aiming at maximizing ridesharing travel was proposed, and a pruning strategy using by K Nearest Neighbors (KNN) query was introduced to improve the efficiency of group discovery. The proposed method was evaluated with extensive experiments on a real dataset of 12000 taxis in Xi'an, in comparison experiments with Dynamic Time Warping (DTW) algorithm, the accuracy and efficiency of the proposed algorithm was increased by 10.12% and 1500% respectively. The experimental results show that the proposed group discovery strategy can effectively improve the accuracy and efficiency of ridesharing user group discovery, and it can effectively improve the rideshared travel rate.

In order to discover the special behaviors of Sub Complex System (SCS) under intervention, the authors proposed the concept of contrast inequality, proposed and implemented the algorithm for mining the segmentwise intervention; by imposing perturbance intervention on SCS, the authors proposed and implemented the causality discovery algorithm. The experiments on the real data show that segmentwise intervention algorithm discovers new intervention rules, and the causality discovery algorithm discovers the causality relations in the air pollution data set, and both are difficultly discovered by traditional methods.